Regional Constellation Reconfiguration Problem: Integer Linear Programming Formulation and Lagrangian Heuristic Method
نویسندگان
چکیده
A group of satellites, with either homogeneous or heterogeneous orbital characteristics and/or hardware specifications, can undertake a reconfiguration process due to variations in operations pertaining Earth observation missions. This paper investigates the problem optimizing satellite constellation against two competing mission objectives: 1) maximization total coverage reward, and 2) minimization cost transfer. The decision variables for include design new configuration assignment satellites from one another. We present novel biobjective integer linear programming formulation that combines transfer problems. lends itself use generic mixed-integer (MILP) methods such as branch-and-bound algorithm computation provably optimal solutions; however, these approaches become computationally prohibitive even moderately sized instances. In response this challenge, proposes Lagrangian relaxation-based heuristic method leverages structure embedded problem. results computational experiments attest near-optimality solutions significant improvement runtime compared commercial MILP solver.
منابع مشابه
Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem
The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming formulation of the GVRP with O(n 2 ) binary variables and O(n 2 ) constraints is presented. It is show...
متن کاملpth Power Lagrangian Method for Integer Programming
When does there exist an optimal generating Lagrangian multi-plier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper cons...
متن کاملMixed Integer Linear Programming Formulation Techniques
A wide range of problems can be modeled as Mixed Integer Linear Programming (MILP) problems using standard formulation techniques. However, in some cases the resulting MILP can be either too weak or to large to be effectively solved by state of the art solvers. In this survey we review advanced MILP formulation techniques that result in stronger and/or smaller formulations for a wide class of p...
متن کاملInteger programming formulation for convoy movement problem
This paper reports a study of the strategic network problem of routing military convoys between specific origin and destination pairs. Known as the Convoy Movement Problem (CMP), this problem is formulated as an integer linear program. The proposed mathematical model is evaluated on the basis of average number of iterations and average CPU times. LP-based lower bounds and heuristic based upper ...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Spacecraft and Rockets
سال: 2023
ISSN: ['1533-6794', '0022-4650']
DOI: https://doi.org/10.2514/1.a35685